Drawing Directed Acyclic Graphs: An Experimental Study
نویسندگان
چکیده
In this paper we consider the class of directed acyclic graphs (DAGs), and present the results of an experimental study on four drawing algorithms speciically developed for DAGs. Our study is conducted on two large test suites of DAGs and yields more than 30 charts comparing the performance of the drawing algorithms with respect to several quality measures, including area, crossings, bends, and aspect ratio. The algorithms exhibit various trade-oos with respect to the quality measures, and none of them clearly outperforms the others.
منابع مشابه
Dominance Drawing of Non-Planar Graphs
In information technology, big data is a term used to describe data sets so large and complex that they become awkward to work and analyze. Difficulties include capture, storage, search, sharing, analysis, and visualization. In this work we focus in the latter part, specifically we study the visualization of graphs. The need for simple and intuitive visualization techniques is more imminent tha...
متن کاملVolume Requirements of 3D Upward Drawings
This paper studies the problem of drawing directed acyclic graphs in three dimensions in the straight-line grid model, and so that all directed edges are oriented in a common (upward) direction. We show that there exists a family of outerplanar directed acyclic graphs whose volume requirement is super-linear. We also prove that for the special case of rooted trees a linear volume upper bound is...
متن کاملDrawing Directed Graphs Using One-Dimensional Optimization
We present an algorithm for drawing directed graphs, which is based on rapidly solving a unique one-dimensional optimization problem for each of the axes. The algorithm results in a clear description of the hierarchy structure of the graph. Nodes are not restricted to lie on fixed horizontal layers, resulting in layouts that convey the symmetries of the graph very naturally. The algorithm can b...
متن کاملWeak Dominance Drawings and Linear Extension Diameter
We introduce the problem of Weak Dominance Drawing for general directed acyclic graphs and we show the connection with the linear extension diameter of a partial order P . We present complexity results and bounds.
متن کاملDAGView: An Approach for Visualizing Large Graphs
In this paper, we propose a novel visualization framework called DAGView. The aim of DAGView is to produce clear visualizations of directed acyclic graphs in which every edge and the potential existence of a path can be immediately spotted by the user. Several criteria that users identified as important in a layout are met, such as underlying grid, crossings and bends that appear perpendicular....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996